TSTP Solution File: SWV435^3 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : SWV435^3 : TPTP v8.1.2. Released v3.6.0.
% Transfm : NO INFORMATION
% Format : NO INFORMATION
% Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.vhxsMyocXO true
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 1 00:09:57 EDT 2023
% Result : Theorem 1.34s 0.75s
% Output : Refutation 1.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 37
% Syntax : Number of formulae : 51 ( 35 unt; 13 typ; 0 def)
% Number of atoms : 101 ( 31 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 57 ( 2 ~; 3 |; 0 &; 47 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 60 ( 60 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 13 usr; 3 con; 0-3 aty)
% Number of variables : 51 ( 39 ^; 12 !; 0 ?; 51 :)
% Comments :
%------------------------------------------------------------------------------
thf(mfalse_type,type,
mfalse: $i > $o ).
thf(icl_says_type,type,
icl_says: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(mor_type,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(icl_true_type,type,
icl_true: $i > $o ).
thf(rel_type,type,
rel: $i > $i > $o ).
thf(mtrue_type,type,
mtrue: $i > $o ).
thf(a_type,type,
a: $i > $o ).
thf(sk__3_type,type,
sk__3: $i ).
thf(icl_princ_type,type,
icl_princ: ( $i > $o ) > $i > $o ).
thf(mvalid_type,type,
mvalid: ( $i > $o ) > $o ).
thf(icl_false_type,type,
icl_false: $i > $o ).
thf(iclval_type,type,
iclval: ( $i > $o ) > $o ).
thf(mbox_type,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(icl_s4_valid,axiom,
( iclval
= ( ^ [X: $i > $o] : ( mvalid @ X ) ) ) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [P: $i > $o] :
! [W: $i] : ( P @ W ) ) ) ).
thf('0',plain,
( mvalid
= ( ^ [P: $i > $o] :
! [W: $i] : ( P @ W ) ) ),
inference(simplify_rw_rule,[status(thm)],[mvalid]) ).
thf('1',plain,
( mvalid
= ( ^ [V_1: $i > $o] :
! [X4: $i] : ( V_1 @ X4 ) ) ),
define([status(thm)]) ).
thf('2',plain,
( iclval
= ( ^ [X: $i > $o] : ( mvalid @ X ) ) ),
inference(simplify_rw_rule,[status(thm)],[icl_s4_valid,'1']) ).
thf('3',plain,
( iclval
= ( ^ [V_1: $i > $o] : ( mvalid @ V_1 ) ) ),
define([status(thm)]) ).
thf(icl_says,axiom,
( icl_says
= ( ^ [A: $i > $o,S: $i > $o] : ( mbox @ rel @ ( mor @ A @ S ) ) ) ) ).
thf(mbox,axiom,
( mbox
= ( ^ [R: $i > $i > $o,P: $i > $o,X: $i] :
! [Y: $i] :
( ( R @ X @ Y )
=> ( P @ Y ) ) ) ) ).
thf('4',plain,
( mbox
= ( ^ [R: $i > $i > $o,P: $i > $o,X: $i] :
! [Y: $i] :
( ( R @ X @ Y )
=> ( P @ Y ) ) ) ),
inference(simplify_rw_rule,[status(thm)],[mbox]) ).
thf('5',plain,
( mbox
= ( ^ [V_1: $i > $i > $o,V_2: $i > $o,V_3: $i] :
! [X4: $i] :
( ( V_1 @ V_3 @ X4 )
=> ( V_2 @ X4 ) ) ) ),
define([status(thm)]) ).
thf(mor,axiom,
( mor
= ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
( ( X @ U )
| ( Y @ U ) ) ) ) ).
thf('6',plain,
( mor
= ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
( ( X @ U )
| ( Y @ U ) ) ) ),
inference(simplify_rw_rule,[status(thm)],[mor]) ).
thf('7',plain,
( mor
= ( ^ [V_1: $i > $o,V_2: $i > $o,V_3: $i] :
( ( V_1 @ V_3 )
| ( V_2 @ V_3 ) ) ) ),
define([status(thm)]) ).
thf('8',plain,
( icl_says
= ( ^ [A: $i > $o,S: $i > $o] : ( mbox @ rel @ ( mor @ A @ S ) ) ) ),
inference(simplify_rw_rule,[status(thm)],[icl_says,'5','7']) ).
thf('9',plain,
( icl_says
= ( ^ [V_1: $i > $o,V_2: $i > $o] : ( mbox @ rel @ ( mor @ V_1 @ V_2 ) ) ) ),
define([status(thm)]) ).
thf(icl_false,axiom,
icl_false = mfalse ).
thf(mfalse,axiom,
( mfalse
= ( ^ [X: $i] : $false ) ) ).
thf('10',plain,
( mfalse
= ( ^ [X: $i] : $false ) ),
inference(simplify_rw_rule,[status(thm)],[mfalse]) ).
thf('11',plain,
( mfalse
= ( ^ [V_1: $i] : $false ) ),
define([status(thm)]) ).
thf('12',plain,
icl_false = mfalse,
inference(simplify_rw_rule,[status(thm)],[icl_false,'11']) ).
thf('13',plain,
icl_false = mfalse,
define([status(thm)]) ).
thf(icl_princ,axiom,
( icl_princ
= ( ^ [P: $i > $o] : P ) ) ).
thf('14',plain,
( icl_princ
= ( ^ [P: $i > $o] : P ) ),
inference(simplify_rw_rule,[status(thm)],[icl_princ]) ).
thf('15',plain,
( icl_princ
= ( ^ [V_1: $i > $o] : V_1 ) ),
define([status(thm)]) ).
thf(untrust,conjecture,
iclval @ ( icl_says @ ( icl_princ @ a ) @ icl_false ) ).
thf(zf_stmt_0,conjecture,
! [X4: $i,X6: $i] :
( ( rel @ X4 @ X6 )
=> ( a @ X6 ) ) ).
thf(zf_stmt_1,negated_conjecture,
~ ! [X4: $i,X6: $i] :
( ( rel @ X4 @ X6 )
=> ( a @ X6 ) ),
inference('cnf.neg',[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl2,plain,
~ ( a @ sk__3 ),
inference(cnf,[status(esa)],[zf_stmt_1]) ).
thf(icl_true,axiom,
icl_true = mtrue ).
thf(mtrue,axiom,
( mtrue
= ( ^ [X: $i] : $true ) ) ).
thf('16',plain,
( mtrue
= ( ^ [X: $i] : $true ) ),
inference(simplify_rw_rule,[status(thm)],[mtrue]) ).
thf('17',plain,
( mtrue
= ( ^ [V_1: $i] : $true ) ),
define([status(thm)]) ).
thf('18',plain,
icl_true = mtrue,
inference(simplify_rw_rule,[status(thm)],[icl_true,'17']) ).
thf('19',plain,
icl_true = mtrue,
define([status(thm)]) ).
thf(ax1,axiom,
( ( icl_princ @ a )
= icl_true ) ).
thf(zf_stmt_2,axiom,
! [V_1: $i] : ( a @ V_1 ) ).
thf(zip_derived_cl0,plain,
! [X0: $i] : ( a @ X0 ),
inference(cnf,[status(esa)],[zf_stmt_2]) ).
thf(zip_derived_cl3,plain,
$false,
inference(demod,[status(thm)],[zip_derived_cl2,zip_derived_cl0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SWV435^3 : TPTP v8.1.2. Released v3.6.0.
% 0.06/0.11 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.vhxsMyocXO true
% 0.11/0.32 % Computer : n006.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Aug 29 10:51:06 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.11/0.32 % Running portfolio for 300 s
% 0.11/0.32 % File : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.32 % Number of cores: 8
% 0.11/0.33 % Python version: Python 3.6.8
% 0.11/0.33 % Running in HO mode
% 0.18/0.63 % Total configuration time : 828
% 0.18/0.63 % Estimated wc time : 1656
% 0.18/0.63 % Estimated cpu time (8 cpus) : 207.0
% 0.18/0.71 % /export/starexec/sandbox/solver/bin/lams/40_c.s.sh running for 80s
% 0.18/0.73 % /export/starexec/sandbox/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.18/0.73 % /export/starexec/sandbox/solver/bin/lams/40_c_ic.sh running for 80s
% 0.18/0.73 % /export/starexec/sandbox/solver/bin/lams/15_e_short1.sh running for 30s
% 0.18/0.73 % /export/starexec/sandbox/solver/bin/lams/40_b.comb.sh running for 70s
% 0.18/0.73 % /export/starexec/sandbox/solver/bin/lams/40_noforms.sh running for 90s
% 1.34/0.75 % Solved by lams/40_c.s.sh.
% 1.34/0.75 % done 2 iterations in 0.012s
% 1.34/0.75 % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 1.34/0.75 % SZS output start Refutation
% See solution above
% 1.34/0.76
% 1.34/0.76
% 1.34/0.76 % Terminating...
% 1.79/0.84 % Runner terminated.
% 1.79/0.86 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------